On Smooth Multivariate Spline Functions
نویسندگان
چکیده
منابع مشابه
On Smooth Multivariate Spline Functions
In this paper the dimensions of bivariate spline spaces with simple cross-cut grid partitions are determined and expressions of their basis functions are given. Consequently, the closures of these spaces over all partitions of the same type can be determined. A somewhat more detailed study on bivariate splines with rectangular grid partitions is included. The results in this paper can be applie...
متن کاملConstruction of spline functions in spreadsheets to smooth experimental data
Experimental data are often in need of smoothing without a pre-determined trend line equation. This manuscript demonstrates how spreadsheet software can be programmed to smooth experimental data via cubic splines. Once the trend lines (splines) have been constructed, it is also simple to interpolate values and calculate derivatives and integrals. The formulas to carry out the calculation are li...
متن کاملWhat is a multivariate spline?
The various concepts and ideas that have contributed to univariate spline theory are considered with a view to finding a suitable definition of a multivariate spline. In this way, an overview of the existing more or less complete univariate spline theory is given along with a survey of some of the high points of the current research in multivariate splines. My very first paper dealt with multiv...
متن کاملHigh order approximation to non-smooth multivariate functions
Approximations of non-smooth multivariate functions return low-order approximations in the vicinities of the singularities. Most prior works solve this problem for univariate functions. In this work we introduce a method for approximating non-smooth multivariate functions of the form f = g + r+ where g, r ∈ C(R) and the function r+ is defined by r+(y) = { r(y), r(y) ≥ 0 0, r(y) < 0 , ∀y ∈ R . G...
متن کاملQuasi-Monte Carlo quadratures for multivariate smooth functions
We compute approximations of multivariate smooth functions by fitting random and quasi-random data to reduced size Tchebychef polynomial approximation models. We discuss the optimization of the data used in the least square method by testing several quasi-random sequences. Points built from optimal quadratic quantization are especially efficient. Very accurate approximation type quadrature form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1983
ISSN: 0025-5718
DOI: 10.2307/2007771